Hybrid Steepest-Descent Methods for Solving Variational Inequalities Governed by Boundedly Lipschitzian and Strongly Monotone Operators

نویسندگان

  • Songnian He
  • Xiao-Lan Liang
  • Tomonari Suzuki
چکیده

Let H be a real Hilbert space and let F : H → H be a boundedly Lipschitzian and strongly monotone operator. We design three hybrid steepest descent algorithms for solving variational inequality VI C, F of finding a point x∗ ∈ C such that 〈Fx∗, x − x∗〉 ≥ 0, for all x ∈ C, where C is the set of fixed points of a strict pseudocontraction, or the set of common fixed points of finite strict pseudocontractions. Strong convergence of the algorithms is proved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid steepest-descent method with sequential and functional errors in Banach space

Let $X$ be a reflexive Banach space, $T:Xto X$ be a nonexpansive mapping with $C=Fix(T)neqemptyset$ and $F:Xto X$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. In this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences ...

متن کامل

Iterative Algorithms for Variational Inequalities Governed by Boundedly Lipschitzian and Strongly Monotone Operators

Consider the variational inequality V I(C, F ) of finding a point x∗ ∈ C satisfying the property 〈Fx∗, x − x∗〉 ≥ 0 for all x ∈ C, where C is a nonempty closed convex subset of a real Hilbert space H and F : C → H is a nonlinear mapping. If F is boundedly Lipschitzian and strongly monotone, then we prove that V I(C, F ) has a unique solution and iterative algorithms can be devised to approximate...

متن کامل

Strong convergence of variational inequality problem Over the set of common fixed points of a family of demi-contractive mappings

In this paper, by using the viscosity iterative method and the hybrid steepest-descent method, we present a new algorithm for solving the variational inequality problem. The sequence generated by this algorithm is strong convergence to a common element of the set of common zero points of a finite family of inverse strongly monotone operators and the set of common fixed points of a finite family...

متن کامل

Strong Weak Convergence Theorems of Implicit Hybrid Steepest-descent Methods for Variational Inequalities

Assume that F is a nonlinear operator on a real Hilbert space H which is strongly monotone and Lipschitzian with constants η > 0 and κ > 0, respectively on a nonempty closed convex subset C of H . Assume also that C is the intersection of the fixed point sets of a finite number of nonexpansive mappings on H . We develop an implicit hybrid steepest-descent method which generates an iterative seq...

متن کامل

Hybrid Steepest Descent Method with Variable Parameters for General Variational Inequalities

Let H be a real Hilbert space and let C be a nonempty closed convex subset of H . Let F :H →H be an operator such that for some constants k,η > 0, F is k-Lipschitzian and η-strongly monotone on C; that is, F satisfies the following inequalities: ‖Fx− Fy‖ ≤ k‖x− y‖ and 〈Fx− Fy,x− y〉 ≥ η‖x− y‖2 for all x, y ∈ C, respectively. Recall that T is nonexpansive if ‖Tx−Ty‖ ≤ ‖x− y‖ for all x, y ∈H . We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010